Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
721	A Continuous Characterization of Maximal Cliques in k-uniform Hypergraphs Samuel Rota Bul`o, and Marcello Pelillo Dipartimento di Informatica. Universit` a Ca’ Foscari di Venezia. Add to Reading List Source URL: www.dsi.unive.it Language: English - Date: 2010-08-27 12:03:59 Graph operations Clique problem Clique Extremal graph theory Hypergraph Vertex cover Line graph Clique-sum Graph theory Theoretical computer science NP-complete problems
722	Bounding χ in terms of ω and ∆ for quasi-line graphs Andrew King and Bruce Reed May 8, 2007 Abstract A quasi-line graph is a graph in which the neighbourhood of any vertex Add to Reading List Source URL: andrewdouglasking.com.s3-website-us-west-2.amazonaws.com Language: English - Date: 2015-03-20 01:35:25 Line graph Clique Graph coloring Interval graph Neighbourhood Path decomposition Chordal graph Graph theory Graph operations NP-complete problems
723	Perfect Matchings in O(n log n) Time in Regular Bipartite Graphs Ashish Goel∗ Michael Kapralov† Sanjeev Khanna‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:49 Graph coloring Combinatorial optimization Hopcroft–Karp algorithm NP-complete problems Edge coloring Bipartite graph Eulerian path Connected component Connectivity Graph theory Mathematics Matching
724	On Incomplete XML Documents with Integrity Constraints Pablo Barcel´ o1 , Leonid Libkin2 , and Juan Reutter2 1 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2010-12-15 16:03:34 Information Markup languages Technical communication XML P-complete Model theory B-tree Integrity constraints Relational database Computing Data Constraint programming
725	Math. Program., Ser. A manuscript No. (will be inserted by the editor) An Exact Combinatorial Algorithm for Minimum Graph Bisection Daniel Delling · Daniel Fleischman · Add to Reading List Source URL: www.ilyaraz.org Language: English - Date: 2014-12-16 13:53:35 Spanning tree NP-complete problems Network flow Routing algorithms Graph Tree decomposition Bridge Tree Flow network Graph theory Mathematics Theoretical computer science
726	Streaming Lower Bounds for Approximating MAX-CUT Michael Kapralov∗ Sanjeev Khanna† Madhu Sudan‡ Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Combinatorial optimization NP-complete problems Matroid theory Matching Graph coloring Cut Maximum cut Pseudoforest Minor Graph theory Mathematics Theoretical computer science
727	A Survey of Automated Timetabling A. Schaerf Dipartimento di Informatica e Sistemistica Universit` a di Roma “La Sapienza” Add to Reading List Source URL: www.diegm.uniud.it Language: English - Date: 2008-12-11 12:42:16 Mathematical optimization Operations research Search algorithms Complexity classes Combinatorial optimization Genetic algorithm Optimization problem Constraint satisfaction NP-complete Theoretical computer science Applied mathematics Computational complexity theory
728	Single Pass Spectral Sparsification in Dynamic Streams Michael Kapralov MIT Yin Tat Lee Add to Reading List Source URL: people.csail.mit.edu Language: English - Date: 2014-12-09 10:13:51 Spanning tree NP-complete problems Algebraic graph theory Combinatorial optimization Matching Laplacian matrix Minimum spanning tree Connectivity Planar separator theorem Graph theory Mathematics Theoretical computer science
729	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
730	July 25, 2007 Problem 1. Real numbers a1 , a2 , . . . , an are given. For each i (1 ≤ i ≤ n) define di = max{aj : 1 ≤ j ≤ i} − min{aj : i ≤ j ≤ n} and let d = max{di : 1 ≤ i ≤ n}. Add to Reading List Source URL: www.georgmohr.dk Language: English - Date: 2007-08-06 03:47:34 Graph operations Clique problem Graph theory Clique NP-complete problems

UPDATE